In Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence ( UAI - 96 ) , Portland , OR , USA , August 1996 Optimal Factory Scheduling using Stochastic Dominance

UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, University of Washington, Seattle, Washington, USA, August 2-5, 2001

By reading, you can know the knowledge and things more, not only about what you get from people to people. Book will be more trusted. As this uai 01 proceedings of the 17th conference in uncertainty in artificial intelligence, it will really give you the good idea to be successful. It is not only for you to be success in certain life you can be successful in everything. The success can be start...

In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence ( UAI - 95 ) , Montreal , Quebec , Canada , August 18 - 20 , 1995 Path Planning under Time - Dependent

Standard algorithms for nding the shortest path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are determinis-tic. We consider the problem of uncertain edge costs, with potential probabilistic dependencies among the costs. Although these dependencies violate the standard dynamic-programming decomposition, we identify a weaker stochastic con...

Submitted to the Twelfth Conference on Uncertainty in Artificial Intelligence ( UAI - 96 ) August 1 - 3 , 1996 , Portland , Oregon , USA

Although probabilistic inference in a general Bayesian belief network is an NP-hard problem, inference computation time can be reduced in most practical cases by exploiting domain knowledge and by making appropriate approximations in the knowledge representation. In this paper we introduce the property of similarity of states and a new method for approximate knowledge representation which is ba...

Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, UAI 2017, Sydney, Australia, August 11-15, 2017

Optimal Factory Scheduling using Stochastic Dominance A*

We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs. Because the costs of operators in the schedule are stochastic and sequence dependent, standard dynamic programming algorithms such as A* may fail to find the optimal schedule. The SDA * (Stochastic Dominance A*) algo­ rithm remedies this d...